Oceanic disjunctions

Learning Disjunctions of Features

Littlestone's Winnow algorithm for learning disjunctions of Boolean attributes where most attributes are irrelevant is one of the most fundamental results in learning theory. Because of the importance of Winnow, it is natural to try extending Winnow to learn disjunctions of features (i.e., concepts). In doing so, we may generalize some earlier applications of Winnow. In this paper, we extend Wi...

Disjunctions, Independence, Reenements

An important question in constraint satisfaction is how to restrict the problem to ensure tractability (since the general problem is NP-hard). The use of disjunctions has proven to be a useful method for constructing tractable constraint classes from existing classes; the well-known`max-closed' and`ORD-Horn' constraints are examples of tractable classes that can be constructed this way. Three s...

Disambiguating with Controlled Disjunctions

In this paper, we propose a disambiguating technique called controlled disjunctions. This extension of the so-called named disjunctions relies on the relations existing between feature values (covariation, control, etc.). We show that controlled disjunctions can implement different kind of ambiguities in a consistent and homogeneous way. We describe the integration of controlled disjunctions in...

Plant Species Disjunctions

Branching on general disjunctions

This paper considers a modification of the branch-and-cut algorithm for Mixed Integer Linear Programming where branching is performed on general disjunctions rather than on variables. We select promising branching disjunctions based on a heuristic measure of disjunction quality. This measure exploits the relation between branching disjunctions and intersection cuts. In this work, we focus on di...